A Novel Radio Geometric Mean Algorithm for a Graph

Radio antennas switch signals in the form of radio waves using different frequency bands electromagnetic spectrum. To avoid interruption, each station is assigned a unique number. The channel assignment problem refers to this application. A geometric mean labeling connected graph G an injective function h from vertex set, V(G) set natural numbers N such that for any two distinct vertices x and y G, h(x)·h(y)≥diam+1−d(x,y). number h, rgmn(h), maximum G. rgmn(G) minimum value taken over all In paper, we present theorems calculating exact paths cycles. We also novel algorithm determining upper bound given graph. verify bounds obtained coincide with paths, cycles, stars, bi-stars.